Almost All Complex Quantifiers Are Simple
نویسنده
چکیده
We prove that PTIME generalized quantifiers are closed under Boolean operations, iteration, cumulation and resumption.
منابع مشابه
Complex demonstratives as quantifiers: objections and replies
In ‘‘Complex Demonstratives: A Quantificational Account’’ (MIT Press 2001) (henceforth CD), I argued that complex demonstratives are quantifiers. Many philosophers had held that demonstratives, both simple and complex, are referring terms. Since the publication of CD various objections to the account of complex demonstratives I defended in it have been raised. In the present work, I lay out the...
متن کاملReflexives and non-Fregean quantifiers
Natural languages display a great variety of constructions which denote non-Freagean quantifiers that is complex quantifiers which are not iterations of simpler quantifiers. Such quantifiers have been extensively studied by Ed (Clark and Keenan (1986), Keenan (1987b), Keenan (1992)). Usually expressions denoting non-Fregean quantifiers are not lexically simple and often they are not syntactic c...
متن کاملOn Concurrence and Entanglement of Rank Two Channels
Concurrence and further entanglement quantifiers can be computed explicitly for channels of rank two if representable by just two Kraus operators. Almost all details are available for the subclass of rank two 1-qubit channels. There is a simple geometric picture beyond, explaining nicely the role of anti-linearity.
متن کاملar X iv : q ua nt - p h / 06 05 10 3 v 1 1 1 M ay 2 00 6 On Concurrence and Entanglement of Rank Two Channels ∗ Armin Uhlmann
Concurrence and further entanglement quantifiers can be computed explicitly for channels of rank two if representable by just two Kraus operators. Almost all details are available for the subclass of rank two 1-qubit channels. There is a simple geometric picture beyond, explaining nicely the role of anti-linearity.
متن کاملExpressive Power and Complexity of a Logic with Quantifiers that Count Proportions of Sets
We present a second order logic of proportional quantifiers, SOLP, which is essentially a first order language extended with quantifiers that act upon second order variables of a given arity r, and count the fraction of elements in a subset of r–tuples of a model that satisfy a formula. Our logic is capable of expressing proportional versions of different problems of complexity up to NP-hard as...
متن کامل